Abstracting Synchronization in Concurrent Constraint Programming

ing Synchronization in Concurrent Constraint Programming ? Enea Za anella1 Roberto Giacobazzi2 Giorgio Levi1 1 Dipartimento di Informatica, Universit a di Pisa Corso Italia 40, 56125 Pisa (za anel,levi)@di.unipi.it 2 LIX, Laboratoire d'Informatique, Ecole Polytechnique 91128 Palaiseau cedex [email protected] Abstract. Because of synchronization based on blocking ask, some of the most important techniques for data ow analysis of (sequential) constraint logic programs (clp) are no longer applicable to cc languages. In particular, the generalized approach to the semantics, intended to factorize the (standard) semantics so as to make explicit the domain-dependent features (i.e. operators and semantic objects which may be in uenced by abstraction) becomes useless for relevant applications. A possible solution to this problem is based on a more abstract (non-standard) semantics: the success semantics, which models non suspended computations only. With a program transformation (NoSynch) that simply ignores synchronization, we obtain a clp-like program which allows us to apply standard techniques for data ow analysis. For suspension-free programs the success semantics is equivalent to the standard semantics thus justifying the use of suspension analysis to generate sound approximations. A second transformation (Angel) is introduced, applying a di erent abstraction of synchronization in possibly suspending programs and resulting in a framework which is adequate to suspension analysis. Applicability and accuracy of these solutions are investigated.